منابع مشابه
Approximate Schedulability Analysis
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo-polynomial time, thereby restricting the application of the concerned models to a large extent. We introduce the notion of “approximate schedulability analysis” and show that if a small amount of “error” (which is spe...
متن کاملDesigning for schedulability: integrating schedulability analysis with object-oriented design
There is a growing interest in using the object paradigm for developing real-time software. We believe that an approach that integrates the advancements in both object modeling and design methods, and real-time scheduling theory is the key to successful use of object technology for real-time software. Surprisingly many past approaches to integrate the two either restrict the object models, or d...
متن کاملContracts for Schedulability Analysis
In this paper we propose a framework of Assume / Guarantee contracts for schedulability analysis. Unlike previous work addressing compositional scheduling analysis, our objective is to provide support for the OEM / supplier subcontracting relation. The adaptation of Assume / Guarantee contracts to schedulability analysis requires some care, due to the handling of conflicts caused by shared reso...
متن کاملFPCL and FPZL Schedulability Analysis
This paper presents the Fixed Priority until Critical Laxity (FPCL) and Fixed Priority until Zero Laxity (FPZL) and scheduling algorithms for multiprocessor real-time systems. FPZL is similar to global fixed priority pre-emptive scheduling; however, whenever a task reaches a state of zero laxity it is given the highest priority. FPCL is a variant of FPZL that introduces no additional scheduling...
متن کاملSchedulability Analysis Using Two Clocks
In classic scheduling theory, real-time tasks are usually assumed to be periodic, i.e. tasks arrive and compute with fixed rates periodically. To relax the stringent constraints on task arrival times, we propose to use timed automata to describe task arrival patterns. In a previous work, it is shown that the general schedulability checking problem for such models is a reachability problem for a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Embedded Computing Systems
سال: 2007
ISSN: 1539-9087,1558-3465
DOI: 10.1145/1324969.1324976